Numerical solution-space analysis of satisfiability problems
نویسندگان
چکیده
منابع مشابه
Numerical solution-space analysis of satisfiability problems.
The solution-space structure of the three-satisfiability problem (3-SAT) is studied as a function of the control parameter α (ratio of the number of clauses to the number of variables) using numerical simulations. For this purpose one has to sample the solution space with uniform weight. It is shown here that standard stochastic local-search (SLS) algorithms like average satisfiability (ASAT) e...
متن کاملNumerical solution of variational problems via Haar wavelet quasilinearization technique
In this paper, a numerical solution based on Haar wavelet quasilinearization (HWQ) is used for finding the solution of nonlinear Euler-Lagrange equations which arise from the problems in calculus of variations. Some examples of variational problems are given and outcomes compared with exact solutions to demonstrate the accuracy and efficiency of the method.
متن کاملAnalysis and Numerical Solution of Control Problems in Descriptor Form
We study linear variable coeecient control problems in descriptor form. Based on a behaviour approach and the general theory for linear diierential algebraic systems we give the theoretical analysis and describe numerically stable methods to determine the structural properties of the system like solvability, regularity, model consistency and redundancy. We also discuss regularization via feedback.
متن کاملInterval Analysis for Certified Numerical Solution of Problems in Robotics
Interval analysis is a relatively new mathematical tool that allows one to deal with problems that may have to be solved numerically with a computer. Examples of such problems are system solving and global optimization, but numerous other problems may be addressed as well. This approach has the following general advantages: (a) it allows to find solutions of a problem only within some finite do...
متن کاملAnalytic and algorithmic solution of random satisfiability problems.
We study the satisfiability of random Boolean expressions built from many clauses with K variables per clause (K-satisfiability). Expressions with a ratio alpha of clauses to variables less than a threshold alphac are almost always satisfiable, whereas those with a ratio above this threshold are almost always unsatisfiable. We show the existence of an intermediate phase below alphac, where the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 2010
ISSN: 1539-3755,1550-2376
DOI: 10.1103/physreve.82.056702